Labelled Markov Processes: Stronger and Faster Approximations
نویسندگان
چکیده
This paper proposes a measure-theoretic reconstruction of the approximation schemes developed for Labelled Markov Processes: approximants are seen as quotients with respect to sets of temporal properties expressed in a simple logic. This gives the possibility of customizing approximants with respect to properties of interest and is thus an important step towards using automated techniques intended for finite state systems, e.g. model checking, for continuous state systems. The measure-theoretic apparatus meshes well with an enriched logic, extended with a greatest fix-point, and gives means to define approximants which retain cyclic properties of their target.
منابع مشابه
Conditional Expectation and the Approximation of Labelled Markov Processes
We develop a new notion of approximation of labelled Markov processes based on the use of conditional expectations. The key idea is to approximate a system by a coarse-graining of the state space and using averages of the transition probabilities. This is unlike any of the previous notions based on the use of simulation. The resulting approximations are customizable, more accurate and stay with...
متن کاملApproximating Labelled Markov Processes Again!
Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of measurable space. The theory as developed so far included a treatment of bisimulation, logical characterization of bisimulation, weak bisimulation, metrics, universal domains for LMPs and approximations. Much of the theory involve...
متن کاملApproximating labelled Markov processes
Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. In this paper, we study approximation techniques for continuous-state labelled Markov processes. We show that the collection of labelled Markov processes carries a Polish-space structure with a countable basis given by finite-state Mar...
متن کاملLabelled Markov Processes
Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is.. Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is.. Systems that can be in a state and have transitions between states; these transitions are triggered by actions. The t...
متن کاملExpressiveness of Probabilistic Modal Logics, Revisited
Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. Logical characterizations of probabilistic bisimulation and simulation were given by Desharnais et al. These results hold for systems defined on analytic state spaces and assume that there are countably many labels in the case of bisim...
متن کامل